Non-Deterministic Finite State Automata Built on DNA
نویسنده
چکیده
This paper describes non-deterministic finite-state automaton based on DNA strands. The automaton uses massive parallel processing offered by molecular approach for computation and exhibits a number of advantages over traditional electronic implementations. This device is used to analyze DNAmolecules, whether they are described by specified regular expression. Presented ideas are confirmed by experiment performed in genetic engineering laboratory.
منابع مشابه
On the Use of Non-deterministic Automata for Presburger Arithmetic
A well-known decision procedure for Presburger arithmetic uses deterministic finite-state automata. While the complexity of the decision procedure for Presburger arithmetic based on quantifier elimination is known (roughly, there is a double-exponential non-deterministic time lower bound and a triple exponential deterministic time upper bound), the exact complexity of the automata-based procedu...
متن کاملLinear Logic Automata
A Linear Logic automaton is a hybrid of a finite automaton and a non-deterministic Petri net. LL automata commands are represented by propositional Horn Linear Logic formulas. Computations performed by LL automata directly correspond to cut-free derivations in Linear Logic. A programming language of LL automata is developed in which typical sequential, nondeterministic and parallel programming ...
متن کاملA Family of NFAs Free of State Reductions
Merging states in finite automata is a main method of reducing the size of the representation of regular languages. The process has been extensively studied for deterministic finite automata, where the conditions for merging states can be efficiently computed. The matter is more complex in the case of non-deterministic finite automata, where merging states can be done in different ways, and the...
متن کاملWatson-Crick automata: determinism and state complexity
Watson-Crick automata are finite state automata working on double-stranded tapes, introduced to investigate the potential of DNA molecules for computing. In this paper, we continue the investigation of descriptional complexity of Watson-Crick automata initiated in [9]. In particular, we show that any finite language as well as any unary regular language can be recognized by a Watson-Crick autom...
متن کاملMulti-head Watson-Crick automata
Inspired by multi-head finite automata and Watson-Crick automata in this paper, we introduce a new structure namely multi-head Watson-Crick automata where we replace the single tape of multi-head finite automaton by a DNA double strand. The content of the second tape is determined using a complementarity relation similar to Watson-Crick complementarity relation. We establish the superiority of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007